Online Search with Maximum Clearance
نویسندگان
چکیده
We study the setting in which a mobile searcher must locate hidden target bounded or unbounded search domain, with no information about hider's position. In particular, we consider online search, performance of strategy is evaluated by its worst case competitive ratio. introduce multi-criteria problem has budget on allotted time, and objective to design strategies that are competitively efficient, respect budget, maximize total searched ground. give analytically optimal for line star domains, efficient heuristics general networks.
منابع مشابه
Online Maximum Matching with Recourse
We study the online maximum matching problem with recourse in a model in which the edges are associated with a known recourse parameter k. An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other. At any moment the algorithm can decide to include an edge into the matching or to exclude it, under the restriction t...
متن کاملOligopolistic Pricing with Online Search
In this paper, we set up a game-theoretic model to examine oligopolistic price competition, considering two features of online search: the existence of a common search ordering and shoppers who have nonpositive search cost. We find that in equilibrium firms set their prices probabilistically rather than deterministically, and different firms follow different price distributions. the equilibrium...
متن کاملFaster exact maximum parsimony search with XMP
MOTIVATION Despite trends towards maximum likelihood and Bayesian criteria, maximum parsimony (MP) remains an important criterion for evaluating phylogenetic trees. Because exact MP search is NP-complete, the computational effort needed to find provably optimal trees skyrockets with increasing numbers of taxa, limiting analyses to around 25-30 taxa. This is, in part, because currently available...
متن کاملOnline Maximum k-Coverage
We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memor...
متن کاملOnline Budgeted Maximum Coverage
We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a given budget. Upon arrival of a set the algorithm must decide whether to accept or to reject the arriving set, and it may also drop previously acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i5.16480